منابع مشابه
Decidable Hybrid Systems
Hybrid systems combine diierential equations with discrete event systems. We consider the reachability problem: is there a trajectory from an initial state to a target state in the hybrid system. We show that for hybrid systems with decoupled diierential inclusions, the reachability problem can be decided in a nite number of steps.
متن کاملDecidable Hybrid Systems
One of the most important analysis problems of hybrid systems is the reacha-bility problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector elds in each discrete ...
متن کاملA New Class of Decidable Hybrid Systems
One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete...
متن کاملSemi-decidable Synthesis for Triangular Hybrid Systems
The algorithmic design of least restrictive controllers for hybrid systems that satisfy reachability specifications has received much attention recently. Despite the importance of algorithmic approaches to controller design for hybrid systems, results that guarantee termination of the algorithms have been limited. In this paper, we extend recent decidability results on controller synthesis for ...
متن کاملDecidable and Semi-decidable Controller Synthesis for Classes of Discrete Time Hybrid Systems
In this paper, we study classes of discrete time hybrid systems for which the classical algorithm for computing the maximal controlled invariant set and the least restrictive controller is computable and guaranteed to terminate in a finite number of iterations. We show how the algorithm can be encoded using quantifier elimination, which leads to a semi-decidability result for definable hybrid s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1996
ISSN: 0895-7177
DOI: 10.1016/0895-7177(96)00072-6